Secure construction of k%2Dunlinkable patient records from distributed providers.

Privacy
Each of two parties PX and P Y holds an n-bit input, x and y, respectively. They wish to privately compute the value of f(x; y). That is, PX should not learn any additional information about y (in the information-theoretic sense) other than what follows from its input x and the function value, f(x; y), and similarly, P Y should not learn any additional information about x.  In this paper we consider two basic questions in the theory of private computations: 1. Which functions can be privately computed ? 2. What is the communication complexity of protocols that privately compute a function  f (in the case that such protocols exist) ? A complete combinatorial characterization of privately computable functions is given. We use this characterization to derive tight bounds on the rounds complexity of any privately computable function, and to design optimal private protocols that compute these functions. We show that for every 1  g(n)  2 \Delta 2  n  there are functions that can be privately...
COAT COnstraint%2Dbased Anonymization of Transactions

Formal anonymity models for efficient privacy%2Dpreserving joins.

Privacy
Each of two parties PX and P Y holds an n-bit input, x and y, respectively. They wish to privately compute the value of f(x; y). That is, PX should not learn any additional information about y (in the information-theoretic sense) other than what follows from its input x and the function value, f(x; y), and similarly, P Y should not learn any additional information about x.  In this paper we consider two basic questions in the theory of private computations: 1. Which functions can be privately computed ? 2. What is the communication complexity of protocols that privately compute a function  f (in the case that such protocols exist) ? A complete combinatorial characterization of privately computable functions is given. We use this characterization to derive tight bounds on the rounds complexity of any privately computable function, and to design optimal private protocols that compute these functions. We show that for every 1  g(n)  2 \Delta 2  n  there are functions that can be privately...
A Privacy%2DPreserving Framework for Integrating Person%2DSpecific Databases.

Privacy Protection Regulations and Technologies%2C Opportunities and Threats.

k%2DUnlinkability A privacy protection model for distributed data.

Recent advances in preserving privacy when mining data.

A Cryptographic Approach to Securely Share and Query Genomic Sequences.

PinKDD%2708 privacy%2C security%2C and trust in KDD post workshop report.
This report summarizes the events of the 2 nd International
Confidentiality Preserving Audits of Electronic Medical Record Access.

First International Workshop on the Model%2DBased Design of Trustworthy Health Information Systems.

PinKDD%2707 privacy%2C security%2C and trust in KDD post%2Dworkshop report.
In this report, we summarize the events of the First International
A computational model to protect patient data from location%2Dbased re%2Didentification.

PinKDD%2707 privacy%2C security%2C and trust in KDD post%2Dworkshop report.
In this report, we summarize the events of the First International
Composition and Disclosure of Unlinkable Distributed Databases.

The Effects of Location Access Behavior on Re%2Didentification Risk in a Distributed Environment.

Configurable Security Protocols for Multi%2Dparty Data Analysis with Malicious Participants.
Standard multi-party computation models assume semi-honest behavior, where the majority of participants implement protocols according to specification, an assumption not always plausible. In this paper we introduce a multi-party protocol for collaborative data analysis when participants are malicious and fail to follow specification. The protocol incorporates a semi-trusted third party, which analyzes encrypted data and provides honest responses that only intended recipients can successfully decrypt. The protocol incorporates data confidentiality by enabling participants to receive encrypted responses tailored to their own encrypted data submissions without revealing plaintext to other participants, including the third party. As opposed to previous models, trust need only be placed on a single participant with no data at stake. Additionally, the proposed protocol is configurable in a way that security features are controlled by independent subprotocols. Various combinations of subprotocols allow for a flexible security system, appropriate for a number of
Integrating Utility into Face De%2Didentification.
Abstract. With the proliferation of inexpensive video surveillance and face recognition technologies, it is increasingly possible to track and match people as they move through public spaces. To protect the privacy of subjects visible in video sequences, prior research suggests using ad hoc obfuscation methods, such as blurring or pixelation of the face. However, there has been little investigation into how obfuscation influences the usability of images, such as for classification tasks. In this paper, we demonstrate that at high obfuscation levels, ad hoc methods fail to preserve utility for various tasks, whereas at low obfuscation levels, they fail to prevent recognition. To overcome the implied tradeoff between privacy and utility, we introduce a new algorithm, k-Same-Select, which is a formal privacy protection schema based on k-anonymity that provably protects privacy and preserves data utility. We empirically validate our findings through evaluations on the FERET database, a large real world dataset of facial images. 1
A Network Analysis Model for Disambiguation of Names in Lists.
In research and application, social networks are increasingly extracted from relationships inferred by name collocations in text-based documents. Despite the fact that names represent real entities, names are not unique identifiers and it is often unclear when two name observations correspond to the same underlying entity. One confounder stems from ambiguity, in which the same name correctly references multiple entities. Prior name disambiguation methods measured similarity between two names as a function of their respective documents. In this paper, we propose an alternative similarity metric based on the probability of walking from one ambiguous name to another in a random walk of the social network constructed from all documents. We experimentally validate our model on actor-actor relationships derived from the Internet Movie Database. Using a global similarity threshold, we demonstrate random walks achieve a significant increase in disambiguation capability in comparison to prior models.
Preserving Privacy by De%2DIdentifying Face Images.

How %28not%29 to protect genomic data privacy in a distributed network using trail re%2Didentification to evaluate and design anonymity protection systems.
The increasing integration of patient-specific genomic data into clinical practice and research raises serious privacy concerns. Various systems have been proposed that protect privacy by removing or encrypting explicitly identifying information, such as name or social security number, into pseudonyms. Though these systems claim to protect identity from being disclosed, they lack formal proofs. In this paper, we study the erosion of privacy when genomic data, either pseudonymous or data believed to be anonymous, is released into a distributed healthcare environment. Several algorithms are introduced, collectively called RE-Identification of Data In Trails (REIDIT), which link genomic data to named individuals in publicly available records by leveraging unique features in patient-location visit patterns. Algorithmic proofs of re-identification are developed and we demonstrate, with experiments on realworld data, that susceptibility to re-identification is neither trivial nor the result of bizarre isolated occurrences. We propose that such techniques can be applied as system tests of privacy protection capabilities.
Inferring Genotype from Clinical Phenotype through a Knowledge Based Algorithm.
This paper  proposes a methodology for such inference. Our method constructs a simple knowledge-based  model without the need of a domain expert and is useful in situations that have very little data  and/or no training data. The model relates a disease&#039;s symptoms to particular clinical states of  the disease. Clinical information is processed using the model, where appropriate weighting of  the symptoms is learned from observed diagnoses to subsequently identify the state of the  disease presented in hospital visits. This approach applies to any simple genetic disorder that  has defined clinical phenotypes. We demonstrate the use of our methods by inferring age of  onset and DNA mutations for Huntington&#039;s disease patients
